DIOPHANTINE APPROXIMATION BY PRIMES

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diophantine Approximation by Primes

We show that whenever δ > 0 and constants λi satisfy some necessary conditions, there are infinitely many prime triples p1, p2, p3 satisfying the inequality |λ0 + λ1p1 + λ2p2 + λ3p3| < (max pj)−2/9+δ. The proof uses Davenport–Heilbronn adaption of the circle method together with a vector sieve method. 2000 Mathematics Subject Classification. 11D75, 11N36, 11P32.

متن کامل

Diophantine Approximation by Cubes of Primes and an Almost Prime

Let λ1, . . . , λs be non-zero with λ1/λ2 irrational and let S be the set of values attained by the form λ1x 3 1 + · · ·+ λsxs when x1 has at most 6 prime divisors and the remaining variables are prime. In the case s = 4, we establish that most real numbers are “close” to an element of S. We then prove that if s = 8, S is dense on the real line.

متن کامل

Diophantine approximation with primes and powers of two

We investigate the values taken by real linear combinations of two primes and a bounded number of powers of two. Under certain conditions, we are able to demonstrate that these values can be made arbitrarily close to any real number by taking sufficiently many powers of two.

متن کامل

Diophantine Approximation by Cubes of Primes and an Almost Prime II

Let λ1, . . . , λ4 be non-zero with λ1/λ2 irrational and negative, and let S be the set of values attained by the form λ1x 3 1 + · · · + λ4x4 when x1 has at most 3 prime divisors and the remaining variables are prime. We prove that most real numbers are close to an element of S.

متن کامل

Diophantine m-tuples for primes

In this paper, we show that if p is a prime and ifA = {a1, a2, . . . , am} is a set of positive integers with the property that aiaj +p is a perfect square for all 1 ≤ i < j ≤ m, then m < 3 · 2168. More generally, when p is replaced by a squarefree integer n, the inequality m ≤ f(ω(n)) holds with some function f , where ω(n) is the number of prime divisors of n. We also give upper bounds for m ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Glasgow Mathematical Journal

سال: 2009

ISSN: 0017-0895,1469-509X

DOI: 10.1017/s0017089509990176